The Fourth PASCAL Recognizing Textual Entailment Challenge

نویسندگان

  • Danilo Giampiccolo
  • Hoa Trang Dang
  • Bernardo Magnini
  • Ido Dagan
  • Elena Cabrio
  • William B. Dolan
چکیده

In 2008 the Recognizing Textual Entailment Challenge (RTE-4) was proposed for the first time as a track at the Text Analysis Conference (TAC). Another important innovation introduced in this campaign was a three-judgment task, which required the systems to make a further distinction between pairs where the entailment does not hold because the content of H is contradicted by the content of T, and pairs where the entailment cannot be determined because the truth of H cannot be verified on the basis of the content of T. A classic twoway task was also offered. RTE-4 attracted 26 teams, more than half of whom submitted runs for the new 3-way task. This paper describes the preparation of the dataset, and gives an overview of the results achieved by the participating systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach using Named Entities for Recognizing Textual Entailment

This paper describes the Sagan system in the context of the Fourth Pascal Recognizing Textual Entailment (RTE-4) Evaluation Challenge. Sagan applies a Support Vector Machine classifier to examples characterized by four features based on: edit distance, distance in WordNet and Longest Common Substring between text and hypothesis. Additionally, we created a filter applying hand-crafted rules base...

متن کامل

Learning Textual Entailment using SVMs and String Similarity Measures

We present the system that we submitted to the 3rd Pascal Recognizing Textual Entailment Challenge. It uses four Support Vector Machines, one for each subtask of the challenge, with features that correspond to string similarity measures operating at the lexical and shallow syntactic level.

متن کامل

Recognizing Textual Entailment Is lexical similarity enough?

We describe the system we used at the PASCAL-2005 Recognizing Textual Entailment Challenge. Our method for recognizing entailment is based on calculating “directed” sentence similarity: checking the directed “semantic” word overlap between the text and the hypothesis. We use frequency-based term weighting in combination with two different lexical similarity measures. Although one version of the...

متن کامل

PASCAL Proceedings of the First Challenge

This paper describes the PASCAL Network of Excellence Recognising Textual Entailment (RTE) Challenge benchmark 1 . The RTE task is defined as recognizing, given two text fragments, whether the meaning of one text can be inferred (entailed) from the other. This applicationindependent task is suggested as capturing major inferences about the variability of semantic expression which are commonly n...

متن کامل

Inferring textual entailment with a probabilistically sound calculus

We introduce a system for textual entailment that is based on a probabilistic model of entailment. The model is defined using a calculus of transformations on dependency trees, which is characterized by the fact that derivations in that calculus preserve the truth only with a certain probability. The calculus is successfully evaluated on the datasets of the PASCAL Challenge on Recognizing Textu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008